Model Checking Computational Tree Logic Using Sticker Automata

The molecular computing has been successfully employed to solve more and more complex computation problems. However, as an important complex problem, the Computational Tree Logic (CTL) model checking is still far from resolved under the circumstance of molecular computing, since it is still a lack of method. To address this issue, an autonomous model checking method is presented for checking all the basic constructs of CTL using DNA computing and sticker automata. As a result, the CTLmodel checking problem under the circumstance of molecular computing is solved preliminary. The simulated experimental results demonstrate the effectiveness of the new method in molecular biology.